Space optimization in deductive databases
نویسندگان
چکیده
منابع مشابه
Constraints for Query Optimization in Deductive Databases
There are many ways in which the query answering process for deductive databases may be optimised. At the heart of many of these methods is some form of constraint on the variables of the query, so that facts which are not relevant to the query are not computed. In this paper we show how fold/unfold transformations may be used to propagate some forms of constraint which are not captured by tech...
متن کاملSemantic Query Optimization in Deductive Object-Oriented Databases
This paper addresses the problem of semantic query reformulation in the context of object-oriented deductive databases. It extends the declarative object-oriented speci cations of F-logic proposed by Kifer and Lausen using the semantic query optimization technique developed by Chakravarthy, Grant, and Minker. In general, query processing in object-oriented databases is expensive when a query in...
متن کاملAn Approach on Semantic Query Optimization for Deductive Databases
In this article we present a learning method to obtain rules for the semantic query optimization in deductive databases. Semantic query optimization can dramatically speed up deductive database query answering by knowledge intensive reformulation. We will present a learning method for rules that will help to semantically optimize queries for deductive databases.i We tried to change the algorith...
متن کاملPreservation properties in deductive databases
This paper constitutes a brief study of the following scheme DAΓ of default reasoning: Given set of premises Σ, assume φ if and only if, for every γ ∈ Γ, Σ ∪ {φ} does not entail γ unless Σ does, where Γ and Σ are sets of clauses, and φ is a clause. The problem of ∀-completeness of DAΓ with respect to nest model semantics is investigated. A method of deriving ∀-completeness of DAΓ1∩Γ2 assuming D...
متن کاملNon-Determinism in Deductive Databases
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the choice construct introduced by Krishnamurthy and Naqvi, from the viewpoints of amenability to efficient implementation and expressive power. Thus, we define a construct called dynamic choice, which is consistent with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 1995
ISSN: 0362-5915,1557-4644
DOI: 10.1145/219035.219056